Geometric Approximation Searching Algorithm for Spatial Straightness Error Evaluation
نویسندگان
چکیده
منابع مشابه
Total variation error bounds for geometric approximation
We develop a new formulation of Stein’s method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a coupling between the original distribution and the “discrete equilibrium” distribution from renewal theory. We illustrate the approach in four nontrivial exam...
متن کاملContinuous Average Straightness in Spatial Graphs
The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to describe the accessibility of a single vertex relatively to all the other vertices in the graph, or even to summarize the graph as a whole. In some cases, o...
متن کاملA Near-Linear Time ε-Approximation Algorithm for Geometric Bipartite
For point sets A,B ⊂ R, |A| = |B| = n, and for a parameter ε > 0, we present a Monte Carlo algorithm that computes, in O(npoly(log n, 1/ε)) time, an ε-approximate perfect matching of A and B under any Lp-norm with high probability; the previously best known algorithm takes Ω(n) time. We approximate the Lp-norm using a distance function, d(·, ·) based on a randomly shifted quad-tree. The algorit...
متن کاملA Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly intersecting unit disks whose centers are in P . The task is to find a set B of m disks of maximum radius such that no disk in B intersects a disk in B ∪ R, where m is the maximum number of unit disks that can be packed. B...
متن کاملAn Improved Algorithm for Image Compression Using Geometric Image Approximation
Our dependence on digital media continues to grow and therefore finding competent ways of storing and conveying these large amounts of data has become a major concern. The technique of image compression has then become very essential and highly applicable. In this paper, the performance of an efficient image coding method based on Geometric Wavelets that divides the desired image using a recurs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Instrumentation
سال: 2013
ISSN: 2165-9257,2165-9273
DOI: 10.4236/mi.2013.21001